TSTP Solution File: NUM736^1 by Leo-III---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.10
% Problem : NUM736^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 7 08:00:40 EDT 2024
% Result : Theorem 2.85s 1.82s
% Output : Refutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 17 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 10 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 62 ( 2 ~; 0 |; 0 &; 58 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 0 ^ 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(frac_type,type,
frac: $tType ).
thf(x_type,type,
x: frac ).
thf(y_type,type,
y: frac ).
thf(nat_type,type,
nat: $tType ).
thf(more_type,type,
more: nat > nat > $o ).
thf(ts_type,type,
ts: nat > nat > nat ).
thf(num_type,type,
num: frac > nat ).
thf(den_type,type,
den: frac > nat ).
thf(less_type,type,
less: nat > nat > $o ).
thf(1,conjecture,
less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz42) ).
thf(2,negated_conjecture,
~ ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(6,plain,
more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: nat,B: nat] :
( ( more @ A @ B )
=> ( less @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz11) ).
thf(7,plain,
! [A: nat,B: nat] :
( ( more @ A @ B )
=> ( less @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(13,plain,
$false,
inference(e,[status(thm)],[5,6,7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM736^1 : TPTP v8.1.2. Released v3.7.0.
% 0.08/0.16 % Command : run_Leo-III %s %d
% 0.17/0.38 % Computer : n020.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Mon May 6 12:25:09 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.97/0.91 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/1.04 % [INFO] Parsing done (125ms).
% 1.19/1.05 % [INFO] Running in sequential loop mode.
% 1.60/1.27 % [INFO] eprover registered as external prover.
% 1.60/1.27 % [INFO] cvc4 registered as external prover.
% 1.60/1.28 % [INFO] Scanning for conjecture ...
% 1.60/1.33 % [INFO] Found a conjecture and 2 axioms. Running axiom selection ...
% 1.82/1.36 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.82/1.38 % [INFO] Problem is higher-order (TPTP THF).
% 1.82/1.38 % [INFO] Type checking passed.
% 1.82/1.38 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 2.85/1.81 % External prover 'e' found a proof!
% 2.85/1.81 % [INFO] Killing All external provers ...
% 2.85/1.82 % Time passed: 1285ms (effective reasoning time: 764ms)
% 2.85/1.82 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.85/1.82 % Axioms used in derivation (2): m, satz11
% 2.85/1.82 % No. of inferences in proof: 8
% 2.85/1.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1285 ms resp. 764 ms w/o parsing
% 2.96/1.85 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.96/1.85 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------